1200A - Hotelier - CodeForces Solution


brute force data structures implementation *800

Please click on ads to support us..

Python Code:

n = int(input())
s = input()
ans = [0] * 10
for i in s:
    if i == 'L':
        for j in range(10):
            if not ans[j]:
                ans[j] = 1
                break
    elif i == 'R':
        for l in range(10):
            if not ans[9 - l]:
                ans[9 - l] = 1
                break
    else:
        ans[int(i)] = 0
print(*ans, sep = '')

C++ Code:

#include<stdio.h>
#include<unordered_map>
#include<iostream>
#include<string>
#include<stack>
#include<set>
#include<string.h>
#include<algorithm>
#include<deque>
#include<vector>
using namespace std;

typedef unsigned int uint;

//char s[1000000];
int ans[10];

int main() {

    
    int n;
    cin >> n;
    //scanf("%s", s);
    for (int i = 0; i < n; i++) {
        char th;
        cin >> th;
        if (th == 'L') {
            int j = 0;
            while (ans[j]) j++;
            ans[j] = 1;
        }
        if (th == 'R') {
            int j = 9;
            while (ans[j]) j--;
            ans[j] = 1;
        }
        else {
            ans[th - '0'] = 0;
        }
    }
    
    for (int j = 0; j < 10; j++) {
        cout << ans[j];
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String